Graph isomorphism problem

Results: 57



#Item
31Capturing Topology in Graph Pattern Matching Shuai Ma1 Yang Cao1 Wenfei Fan2 1 NLSDE Lab, Beihang University

Capturing Topology in Graph Pattern Matching Shuai Ma1 Yang Cao1 Wenfei Fan2 1 NLSDE Lab, Beihang University

Add to Reading List

Source URL: vldb.org

Language: English - Date: 2011-12-25 09:36:22
32NeMa: Fast Graph Search with Label Similarity Arijit Khan Yinghui Wu Charu C. Aggarwal Xifeng Yan Computer Science University of California, Santa Barbara  IBM T. J. Watson Research

NeMa: Fast Graph Search with Label Similarity Arijit Khan Yinghui Wu Charu C. Aggarwal Xifeng Yan Computer Science University of California, Santa Barbara IBM T. J. Watson Research

Add to Reading List

Source URL: www.vldb.org

Language: English - Date: 2013-02-20 04:21:44
3320th International Congress on Modelling and Simulation, Adelaide, Australia, 1–6 December 2013 www.mssanz.org.au/modsim2013 A first approach to resolving ambiguity in hidden terrorist group detection in communications

20th International Congress on Modelling and Simulation, Adelaide, Australia, 1–6 December 2013 www.mssanz.org.au/modsim2013 A first approach to resolving ambiguity in hidden terrorist group detection in communications

Add to Reading List

Source URL: www.mssanz.org.au

Language: English - Date: 2013-11-19 21:59:56
34Towards Generation of High-performance Transformations Attila Vizhanyo, Aditya Agrawal, Feng Shi Institute for Software Integrated Systems, Vanderbilt University Nashville, TN 37235, USA {viza, aditya, fengshi }@isis.van

Towards Generation of High-performance Transformations Attila Vizhanyo, Aditya Agrawal, Feng Shi Institute for Software Integrated Systems, Vanderbilt University Nashville, TN 37235, USA {viza, aditya, fengshi }@isis.van

Add to Reading List

Source URL: www.isis.vanderbilt.edu

Language: English - Date: 2008-06-17 14:04:56
35Frequent Subgraph Discovery in Dynamic Networks Bianca Wackersreuther Peter Wackersreuther  Annahita Oswald

Frequent Subgraph Discovery in Dynamic Networks Bianca Wackersreuther Peter Wackersreuther Annahita Oswald

Add to Reading List

Source URL: www.dbs.ifi.lmu.de

Language: English - Date: 2010-08-16 05:10:29
36Near-optimal supervised feature selection among frequent subgraphs Marisa Thoma∗ Alex Smola¶ Hong Cheng† Le Songk

Near-optimal supervised feature selection among frequent subgraphs Marisa Thoma∗ Alex Smola¶ Hong Cheng† Le Songk

Add to Reading List

Source URL: www.dbs.ifi.lmu.de

Language: English - Date: 2010-08-11 08:56:30
37Eigenspaces of Graphs. By Dragos Cvetkovic, Peter Rowlinson, and Slobodan Simic. Cambridge University Press, Cambridge, UK, 1997. $[removed]xiii+258 pp., hardback. ISBN[removed]This volume continues a series of monog

Eigenspaces of Graphs. By Dragos Cvetkovic, Peter Rowlinson, and Slobodan Simic. Cambridge University Press, Cambridge, UK, 1997. $[removed]xiii+258 pp., hardback. ISBN[removed]This volume continues a series of monog

Add to Reading List

Source URL: buzzard.ups.edu

Language: English - Date: 2009-08-27 14:28:22
38Incremental Sequential Equivalence Checking and Subgraph Isomorphism Sayak Ray Alan Mishchenko  Robert Brayton

Incremental Sequential Equivalence Checking and Subgraph Isomorphism Sayak Ray Alan Mishchenko Robert Brayton

Add to Reading List

Source URL: www.bvsrc.org

Language: English - Date: 2009-07-12 14:37:50
39The Stanford GraphBase: A Platform for Combinatorial Algorithms A highly portable collection of programs and data will soon be available to researchers who study combinatorial algorithms and data structures. All files w

The Stanford GraphBase: A Platform for Combinatorial Algorithms A highly portable collection of programs and data will soon be available to researchers who study combinatorial algorithms and data structures. All files w

Add to Reading List

Source URL: shadow.ind.ntou.edu.tw

Language: English - Date: 2007-12-06 06:56:00
40The Stanford GraphBase: A Platform for Combinatorial Algorithms A highly portable collection of programs and data will soon be available to researchers who study combinatorial algorithms and data structures. All files w

The Stanford GraphBase: A Platform for Combinatorial Algorithms A highly portable collection of programs and data will soon be available to researchers who study combinatorial algorithms and data structures. All files w

Add to Reading List

Source URL: mirrors.fe.up.pt

Language: English - Date: 2007-12-06 06:56:00